Location:
Search - NFA D
Search list
Description: 遗传算法与工程设计-玄光男,程润伟著-电子书pdf格式-Genetic Algorithms and Engineering Design-Yuen-man, Guilin-to-pdf format e-books
Platform: |
Size: 6816768 |
Author: 290227403 |
Hits:
Description: [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
Platform: |
Size: 149504 |
Author: 三块一 |
Hits:
Description: 正规(则)表达式转化为NFA，DFA，DFA最小化，显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed
Platform: |
Size: 2227200 |
Author: 杨心海 |
Hits:
Description: 词法分析器
re->nfa->d fa优化-Lexical analyzer re-> nfa-> dfa-> dfa Optimization
Platform: |
Size: 3072 |
Author: 周子神 |
Hits:
Description: 可实现，nfa到dfa的转化，利用c语言编写，本人以用过一次，老师评价很好-Can be achieved, nfa to dfa conversion using c language, I used once, very good teacher evaluation
Platform: |
Size: 2048 |
Author: 黄飞 |
Hits:
Description: 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
Platform: |
Size: 263168 |
Author: 王据林 |
Hits:
Description: Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits: